Source Coding with in-Block Memory and Causally Controllable Side Information

نویسنده

  • Osvaldo Simeone
چکیده

The recently proposed set-up of source coding with a side information “vending machine” allows the decoder to select actions in order to control the quality of the side information. The actions can depend on the message received from the encoder and on the previously measured samples of the side information, and are cost constrained. Moreover, the final estimate of the source by the decoder is a function of the encoder’s message and depends causally on the side information sequence. Previous work by Permuter and Weissman has characterized the rate-distortioncost function in the special case in which the source and the “vending machine” are memoryless. In this work, motivated by the related channel coding model introduced by Kramer, the ratedistortion-cost function characterization is extended to a model with in-block memory. Various special cases are studied including block-feedforward and side information repeat request models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

مقاوم سازی بردار حرکت در برابر خطای کانال جهت بهبود کیفیت ویدیوی ‎دریافتی

According to progress of technology during the recent decades, video transmission through a wireless channel has found high demands. In this field, several methods have been proposed to improve video quality. Appearing error in motion vector values is one of the most important factors which can affect the video quality. In case of creating errors in motion vector, the synthesized video frames a...

متن کامل

Distributed and cascade lossy source coding with a side information "vending machine"

Source coding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information available at the decoder and the source sequence can be controlled by the decoder based on the message received from the encoder. In this paper, the characterization of the optimal rate-distortion performance as a function of the cost associ...

متن کامل

On the redundancy of Slepian--Wolf coding

In this paper, the redundancy of both variable and fixed rate Slepian–Wolf coding is considered. Given any jointly memoryless source-side information pair with finite alphabet, the redundancy of variable rate Slepian–Wolf coding of  with decoder only side information depends on both the block length and the decoding block error probability , and is defined as the difference between the minimum...

متن کامل

Source Coding with Causal Side Information at the Decoder

2 ⌋ }. The i-th reconstruction is of the form X̂i(T, Y ), i.e., it is allowed to depend on the side information, but only causally. The motivation for studying this problem comes from source coding systems that are constrained to operate with no, or with limited, delay. Sequential source codes with a limited-delay encoder and a sequential, zero-delay, decoder with access to side information comp...

متن کامل

Low-Delay Prediction- and Transform-Based Wyner-Ziv Coding

This paper studies low-delay Wyner–Ziv coding, i.e., lossy source coding with side information at the decoder, with emphasis on the extreme of zero delay. To achieve zero delay, a scalar quantizer is followed by scalar coding of quantization indices. In the fixed-length coding scenario, under high-resolution assumptions and appropriately defined decodability constraints, the optimal quantizatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1301.0926  شماره 

صفحات  -

تاریخ انتشار 2013